Most Likely Traffic Equilibrium Route Flows

When analyzing equilibrium traac ows it is usually the link ows and link travel demands that are of interest, but in some certain cases analyses require the knowledge of route ows. It is well known that the route ows are non-unique in the static and deterministic cases of traac equilibrium. Furthermore, diierent assignment methods can generate diierent route ow output. We show how this non-uniqueness can aaect the results in applications such as in the O{D estimation/adjustment problem, in the construction of induced O{D matrices, exhaust fume emission analyses and in link toll usage analyses. We state a model for nding, uniquely, the most likely route ows given the equilibrium link ows, and propose a solution algorithm for the problem based on partial dualization. We present computational results for the proposed algorithm and results from an application to exhaust fume emissions.